/**
 * @program: LeetCode
 * @description: LeetCode : 96. 不同的二叉搜索树
 * @author: WXY
 * @create: 2023-01-06 13:21
 * @Version 1.0
 **/
public class Num096_numTrees {

    public static int numTrees(int n) {
        int[] dp = new int[n + 1];
        dp[0] = 1;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            for (int j = 0; j < i; j++) {
                dp[i] += dp[j] * dp[i - j - 1];
            }
        }
        return dp[n];
    }


    public static void main(String[] args) {
        int num = numTrees(3);
        System.out.println(num);

    }
}
